Valued Constraint Satisfaction Problems Applied to Functional Harmony
نویسندگان
چکیده
Harmonization with four voices is a musical problem which is subject to hard constraints, which absolutely need to be fulfilled, as well as to soft constraints, which preferably hold, but are not mandatory. In this paper, we model this problem as a valued constraint satisfaction problem (VCSP): costs are assigned to possible solutions based on the constraints they violate. We design an algorithm that finds a minimal-cost solution, thus solving the harmonization problem, and we present initial results obtained by this algorithm. Keywords— functional harmony, valued constraint satisfaction problems, soft constraints
منابع مشابه
The Complexity of Valued Constraint Satisfaction
We survey recent results on the broad family of problems that can be cast as valued constraint satisfaction problems. We discuss general methods for analysing the complexity of such problems, give examples of tractable cases, and identify general features of the complexity landscape.
متن کاملThe Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in the VCSP framework. Using our analysis, we show that some optimisation problems, such as (s, t)-Min-Cut and Submodular Function Minimisation, can be modelled using a restricted set of valued constraints which are tra...
متن کاملAn Incomplete Method for Solving Distributed Valued Constraint Satisfaction Problems
This paper sets a model for Distributed Valued Constraint Satisfaction Problems, and proposes an incompletemethod for solving such problems. This method is a greedy repair distributed algorithm which extends to the distributed case any greedy repair centralized algorithm. Experiments are carried out on a real-world problem and show the practical interest of this method.
متن کاملBinarisation for Valued Constraint Satisfaction Problems
We study methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the algebraic properties that capture the computational complexity of VCSPs. Second, we extend the reduction of CSPs to binary CSPs described by Bulín et al. [LMCS’15] to VCSPs. This reduction establishes that VCSPs over a fi...
متن کاملThe Complexity of Valued CSPs
We survey recent results on the broad family of problems that can be cast as valued constraint satisfaction problems (VCSPs). We discuss general methods for analysing the complexity of such problems, give examples of tractable cases, and identify general features of the complexity landscape. 1998 ACM Subject Classification F.1.3 Complexity Measures and Classes, G.1.6 Optimization
متن کامل